Extension of source coding theorems for block codes to sliding-block codes

J. Kiimer and K. Marton, “General broadcast channels with degraded message sets,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 60-64, 1977. G. S. Poltyrev, lecture at the Hungarian-Soviet-Czechoslovak Seminar on Information Theory, Tsahkadsor, Sept. lo17, 1978. I. C.&z.&, J. Khmer, and K. Marton, “A new look at exponential error bounds for memoryless channels,” Preprint presented at the 1977 IEEE Information Theory Symposium, Cornell University, I thaca NY. E. A. Haroutunian, “Estimates of the error exponent for the semi-cont inuous memoryless channel,” (in Russian) Probl. Per. Znf., 4, vol. 4, pp. 37-48, 1968. R. E. Blahut, “Hypothesis testing and information theory,” IEEE Trans. Znform. Theov, vol. IT-20, pp. 405-417, 1974. I. Csistir and J. Kiimer, Znformation Theory. Coding Theorems for Discrete Memoryless Systems. Forthcoming book. R. G. Gallager, Information Theory and Reliable Communication. New York: W iley, 1968. G. Dueck and J. Kiimer, “Reliability function of a discrete memoryless channel at rates above capacity,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 82-85, Jan. 1979. I. Csisr.& and J. Khmer, “Graph decomposit ion: A new key to coding theorems,” IEEE Trans. Inform. Theoty, vol. IT-27, Jan. 1981, to be publ ished. T. Cover, “Broadcast channels,” IEEE Trans. Inform. Theory, vol. IT-l& pp. 214, 1972. P. P. Bergmans, “Coding theorem for broadcast channels with degraded components,” IEEE Trans. Inform. Theov, vol. IT-19, pp. 197-207, 1973. V. D. Goppa, “Nonprobabil istic mutual information without mem;I-&’ (In Russian) Problems Control Znf. Th., vol. 4, pp. 97102,